Nuprl Lemma : fun-path-cons 11,40

T:Type, f:(TT), L:(T List), xyz:T.
z=f*(x) via [y / L]
 {z = y
 & ((0 < ||L||)  (y = f(hd(L)) & ((y = hd(L))) & hd(L)=f*(x) via L))
 & (((0 < ||L||))  (x = y))} 
latex


Definitionstype List, Type, t  T, s = t, x:AB(x), x:A  B(x), P & Q, P  Q, x:AB(x), P  Q, a < b, Void, False, A, ||as||, n+m, {i..j}, #$n, [], A  B, , , -n, , l[i], f(a), {x:AB(x)} , i  j < k, [car / cdr], A List, P  Q, hd(l), i <z j, i j, last(L), {T}, y=f*(x) via L, n - m, i  j , tl(l), s ~ t, True, T, SQType(T), left + right, P  Q, Dec(P), Atom, , b, x,y:A//B(x;y), x:AB(x), b | a, a ~ b, |p|, a  b, a <p b, |g|, a < b, A c B, x f y, |r|, xLP(x), (xL.P(x)), Unit,
Lemmasdecidable int equal, guard wf, length cons, nat wf, le wf, true wf, squash wf, iff wf, rev implies wf, select cons tl, non neg length, length wf1, int seg wf, select wf, not wf, member wf, length wf2

origin